Proactive Linear Integer Secret Sharing
نویسنده
چکیده
In [3] Damgard and Thorbek proposed the linear integer secret sharing (LISS) scheme. In this note we show that the LISS scheme can be made proactive.
منابع مشابه
Applying General Access Structure to Proactive Secret Sharing Schemes
Verifiable secret sharing schemes (VSS) are secret sharing schemes (SSS) dealing with possible cheating by participants. In this paper we use the VSS proposed by Cramer, Damgard and Maurer [6, 7, 5]. They introduced a purely linear algebraic method to transform monotone span program (MSP) based secret sharing schemes into VSS. In fact, the monotone span program model of Karchmer and Wigderson [...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملA Novel Proactive Multi-secret Sharing Scheme
A proactive secret sharing scheme is a method of sharing a secret among a set of participants. And, the corresponding shadows can be periodically renewed under the premise of never changing the shared secret. However, in the most existing proactive secret sharing schemes, only one secret can be shared during one secret sharing process. The proposed scheme describes PMSS, a new way to share mult...
متن کاملMobile Proactive Secret Sharing in Cloud Computing
This research paper introduces a scheme to secure any secret value in cloud network by Mobile Proactive Secret Sharing (MPSS). This is an extension of proactive secret sharing, where contributing parties of a network hold the shares of a secret value. Mobile proactive secret sharing is much more flexible than proactive secret sharing in terms of group membership: instead of the group of shareho...
متن کاملUnconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures
Verifiable secret sharing schemes (VSS) are secret sharing schemes dealing with possible cheating by the participants. In this paper, we propose a new unconditionally secure VSS. Then we construct a new proactive secret sharing scheme based on that VSS. In a proactive scheme, the shares are periodically renewed so that an adversary cannot get any information about the secret unless he is able t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2009 شماره
صفحات -
تاریخ انتشار 2009